Iterative Gram-Schmidt orthonormalization for efficient parameter estimation
نویسنده
چکیده
We present an e cient method for estimating nonlinearly entered parameters of a linear signal model corrupted by additive noise. The method uses the Gram-Schmidt orthonormalization procedure in combination with a number of iterations to de-bias and re-balance the coupling between non-orthogonal signal components e ciently. Projection interpretation is provided as rationale of the proposed iterative algorithm. Computer simulations are conducted to show the e ectiveness of the algorithm.
منابع مشابه
First-order approximation of Gram-Schmidt orthonormalization beats deflation in coupled PCA learning rules
In coupled learning rules for principal component analysis, eigenvectors and eigenvalues are simultaneously estimated in a coupled system of equations. Coupled single-neuron rules have favorable convergence properties. For the estimation of multiple eigenvectors, orthonormalization methods have to be applied, either full Gram-Schmidt orthonormalization, its first-order approximation as used in ...
متن کاملTwo-step demodulation based on the Gram-Schmidt orthonormalization method.
This Letter presents an efficient, fast, and straightforward two-step demodulating method based on a Gram-Schmidt (GS) orthonormalization approach. The phase-shift value has not to be known and can take any value inside the range (0,2π), excluding the singular case, where it corresponds to π. The proposed method is based on determining an orthonormalized interferogram basis from the two supplie...
متن کاملEnhanced Gram-Schmidt Process for Improving the Stability in Signal and Image Processing
The Gram-Schmidt Process (GSP) is used to convert a non-orthogonal basis (a set of linearly independent vectors) into an orthonormal basis (a set of orthogonal, unit-length vectors). The process consists of taking each vector and then subtracting the elements in common with the previous vectors. This paper introduces an Enhanced version of the Gram-Schmidt Process (EGSP) with inverse, which is ...
متن کاملCoupled Singular Value Decomposition of a Cross-Covariance Matrix
We derive coupled on-line learning rules for the singular value decomposition (SVD) of a cross-covariance matrix. In coupled SVD rules, the singular value is estimated alongside the singular vectors, and the effective learning rates for the singular vector rules are influenced by the singular value estimates. In addition, we use a first-order approximation of Gram-Schmidt orthonormalization as ...
متن کاملTime Efficient Face Recognition Using Stable Gram-Schmidt Orthonormalization
Most commonly used face recognition algorithms are based on extraction of global features using eigenvalue decomposition of some relational matrix of image intensity values. Real time face recognition applications require a computationally efficient algorithm for eigenvalues generation. Fast principal component analysis (FPCA) is an algorithm for efficient generation of eigenvalues which improv...
متن کامل